Decomposing toroidal graphs into circuits and edges
نویسندگان
چکیده
منابع مشابه
Decomposing toroidal graphs into circuits and edges
Erdős et al. (Canad. J. Math. 18 (1966) 106–112) conjecture that there exists a constant dce such that every simple graph on n vertices can be decomposed into at most dcen circuits and edges. We consider toroidal graphs, where the graphs can be embedded on the torus, and give a polynomial time algorithm to decompose the edge set of an even toroidal graph on n vertices into at most (n + 3)/2 cir...
متن کاملDecomposing Random Graphs into Few Cycles and Edges
Over 50 years ago, Erdős and Gallai conjectured that the edges of every graph on n vertices can be decomposed into O(n) cycles and edges. Among other results, Conlon, Fox and Sudakov recently proved that this holds for the random graph G(n, p) with probability approaching 1 as n → ∞. In this paper we show that for most edge probabilities G(n, p) can be decomposed into a union of n4 + np 2 + o(n...
متن کاملDecomposing Graphs into Long Paths
It is known that the edge set of a 2-edge-connected 3-regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2-edge-connected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, and K4 − e have no such decompositions. We construct an infinite sequence {Fi}∞i=0 of nondecomposable graphs. On the other hand, we prove that every...
متن کاملDecomposing complete graphs into isomorphic subgraphs with six vertices and seven edges
Appendix (Constructions of the desired graph designs in the last table of our paper) In the following constructions, the block set of each G k-GD(v) is denoted by B k (v), and its vertex set is taken as (Z 3 × Z 2) {∞} for v = 7, or Z v for v = 8, 15, 29, or Z v−1 {∞} for v = 14, 28 besides other set, which will be specially denoted.
متن کاملDecomposing complete graphs into cubes
This talk concerns when the complete graph on n vertices can be decomposed into d-dimensional cubes, where d is odd and n is even. (All other cases have been settled.) Necessary conditions are that n ≡ 1 (mod d) and n ≡ 0 (mod 2). These are known to be sufficient for d equal to 3 or 5, but for larger values of d a decomposition has been proven to exist for only sparce sets of n. We prove that f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2005
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.10.006